Optimal SAT Solver Synthesis of Quantum Circuits Representing Cryptographic Nonlinear Functions
نویسندگان
چکیده
منابع مشابه
Structures of Highly Nonlinear Cryptographic Functions
This paper studies the properties and constructions of nonlinear Boolean functions, which are a core component of cryptographic primitives including data encryption algorithms and one-way hash functions. A main contribution of this paper is to completely characterise the structures of cryptographic functions that satisfy the propagation criterion with respect to all but six or less vectors.
متن کاملOptimal Cryptographic Hardness of Learning Monotone Functions
A wide range of positive and negative results have been established for learning different classes of Boolean functions from uniformly distributed random examples. However, polynomial-time algorithms have thus far been obtained almost exclusively for various classes of monotone functions, while the computational hardness results obtained to date have all been for various classes of general (non...
متن کاملEncoding Cryptographic Functions to SAT Using TRANSALG System
In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using state-of-theart SAT solvers. We implemented this technology in the form of the software system called TRANSALG, and used it to construct SAT encodings for a number of cryptanalysis problems. By applying SAT solvers to the...
متن کاملOptimal Synthesis of Fanoutfree Functions Optimal Synthesis of Fanoutfree Functions
The problem of provable optimal synthesis of boolean functions for a given technology is still unsolved. In this paper we study the problem for the small class of fanoutfree functions. Every fanoutfree function can be uniquely represented by a Normal AND-OR-Tree. Based on this representation, we introduce algorithms for provable optimal synthesis of any n-input fanoutfree function over a given ...
متن کاملSynthesis of Quantum Multiplexer Circuits
Combinational quantum circuits are essential for quantum computation; and quantum multiplexer circuit is one of the important combinational circuits. In this paper, we have presented the synthesis of quantum multiplexer circuit in detail. Instead of using functional blocks, we have used physically realizable quantum logic gates for synthesis of quantum multiplexers. In addition to this, our syn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics and Telecommunications
سال: 2023
ISSN: ['2300-1933', '2081-8491']
DOI: https://doi.org/10.24425/ijet.2023.144359